The z-Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings
نویسنده
چکیده
A nonhomogeneous system of linear recurrence equations can be recognized by an automaton A over a one-letter alphabet A = {z}. Conversely, the automaton A generates precisely this nonhomogeneous system of linear recurrence equations. We present the solutions of these systems and apply the z-transform to these solutions to obtain their series representation. Finally, we show some results that simplify the series representation of the z-transform of these solutions. We consider single systems as well as the composition of two systems.
منابع مشابه
Recognizable Tree Series with Discounting
We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSOlogic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.
متن کاملAn Approximate Method for System of Nonlinear Volterra Integro-Differential Equations with Variable Coefficients
In this paper, we apply the differential transform (DT) method for finding approximate solution of the system of linear and nonlinear Volterra integro-differential equations with variable coefficients, especially of higher order. We also obtain an error bound for the approximate solution. Since, in this method the coefficients of Taylor series expansion of solution is obtained by a recurrence r...
متن کاملBounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations
By using some solvability methods and the contraction mapping principle are investigated bounded, as well as periodic solutions to some classes of nonhomogeneous linear second-order difference equations on domains N0, Z \N2 and Z. The case when the coefficients of the equation are constant and the zeros of the characteristic polynomial associated to the corresponding homogeneous equation do not...
متن کاملWeighted Tree Automata over Strong Bimonoids
We consider weighted tree automata over strong bimonoids which are, roughly speaking, semirings without distributivity. We prove sufficient and necessary conditions under which the initial algebra semantics and the run semantics of these automata coincide. We prove closure properties of the class of recognizable tree series, a determinization result, and a characterization of recognizable step ...
متن کاملPAWS: A Tool for the Analysis of Weighted Systems
PAWS is a tool to analyse the behaviour of weighted automata and conditional transition systems. At its core PAWS is based on a generic implementation of algorithms for checking language equivalence in weighted automata and bisimulation in conditional transition systems. This architecture allows for the use of arbitrary user-defined semirings. New semirings can be generated during run-time and ...
متن کامل